A New Calculus for Semantic Matching ?

In this paper, we present Reverse Restructuring, a new calculus for solving the semantic matching problem. For narrowing, advanced selection rules are commonly seen as an appropriate method to reduce the search space. Our approach to design a special calculus for special goals is another way of reducing the eeciency defects of narrowing. Reverse Restructuring constructs derivations in the reverse direction by guessing terms from which an already known term might be derived. To this end, the rules of the underlying term rewriting system are also applied in the reverse direction, i.e. from right to left. We show the soundness and completeness of this calculus and demonstrate its eeciency for an important class of problems.